By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 19, Issue 1, pp. 1-206

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages

Michael A. Palis, Sunil Shende, and David S. L. Wei

pp. 1-31

Complexity and Unsolvability Properties of Nilpotency

I. R. Hentzel and D. Pokrass Jacobs

pp. 32-43

The Complexity of Very Simple Boolean Formulas with Applications

H. B. Hunt III and R. E. Stearns

pp. 44-70

Lower Bounds for the Stable Marriage Problem and Its Variants

Cheng Ng and Daniel S. Hirschberg

pp. 71-77

A Rewriting System for Categorical Combinators with Multiple Arguments

Hirofumi Yokouchi and Teruo Hikita

pp. 78-97

The Inverses of Block Hankel and Block Toeplitz Matrices

George Labahn, Dong Koo Choi, and Stan Cabay

pp. 98-123

A Density Theorem for Purely Iterative Zero Finding Methods

Joel Friedman

pp. 124-132

A Fast Parallel Horner Algorithm

Michael L. Dowling

pp. 133-142

Very Simple Methods for All Pairs Network Flow Analysis

Dan Gusfield

pp. 143-155

On the Expected Capacity of Binomial and Random Concentrators

Edward R. Scheinerman

pp. 156-163

Space-Efficient Message Routing in $c$-Decomposable Networks

Greg N. Frederickson and Ravi Janardan

pp. 164-181

Feasible Real Functions and Arithmetic Circuits

H. James Hoover

pp. 182-204

Erratum: Generalized Selection and Ranking: Sorted Matrices

Greg N. Frederickson and Donald B. Johnson

pp. 205-206